Determination of Operability Limits Using Simplicial Approximation

نویسندگان

  • Vishal Goyal
  • Marianthi G. Ierapetritou
چکیده

Determining the boundaries of any processrdesign where feasible and safe operation is guaranteed has long been recognized as a major concern in process industries. Of additional ®alue is identifying the range of operating conditions where the design is most profitable. Although there is a lot of discussion in the open literature regarding design feasibility in terms of uncertainty of process ®ariables, these techniques are rather limited due to the underestimation of the feasible space. A new approach is presented based on the ideas of inner and outer approximation of the feasible region to identify the operating en®elopes where process operation is feasible, safe, and profitable. A number of example problems are presented including two case studies to illustrate the applicability of this approach.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Optimum Design of Steructures With Reqency Response Consteraint Using High Quality Approximation

An efficient technique is presented for optimum design of structures with both natural frequency and complex frequency response constraints. The main ideals to reduce the number of dynamic analysis by introducing high quality approximation. Eigenvalues are approximated using the Rayleigh quotient. Eigenvectors are also approximated for the evaluation of eigenvalues and frequency responses. A tw...

متن کامل

Best Quadratic Spline Approximation

We present a method for hierarchical data approximation using quadratic simplicial elements for domain decomposition and field approximation. Higher-order simplicial elements can approximate data better than linear elements. Thus, fewer quadratic elements are required to achieve similar approximation quality. We use quadratic basis functions and compute best quadratic simplicial spline approxim...

متن کامل

Vertex Decomposable Simplicial Complexes Associated to Path Graphs

Introduction Vertex decomposability of a simplicial complex is a combinatorial topological concept which is related to the algebraic properties of the Stanley-Reisner ring of the simplicial complex. This notion was first defined by Provan and Billera in 1980 for k-decomposable pure complexes which is known as vertex decomposable when . Later Bjorner and Wachs extended this concept to non-pure ...

متن کامل

Determination of Ultimate Pit Limits in Open Mines Using Real Option Approach

Planning and design procedure of an open pit mining project just can be started after ultimate pit determination. In the carried out study in this paper it was shown that the most important factor in ultimate pit determination and in consequence in the whole planning and design procedure of an open pit mine is the metal price. Metal price fluctuations in recent years were exaggerated and impose...

متن کامل

Approximation algorithms for Max Morse Matching

In this paper, we prove that the Max-Morse Matching Problem is approximable, thus resolving an open problem posed by Joswig and Pfetsch [14]. We describe two different approximation algorithms for the Max-Morse Matching Problem. For D–dimensional simplicial complexes, we obtain a (D+1)/(D2+D+1)factor approximation ratio using a simple edge reorientation algorithm that removes cycles. Our second...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002